A Software Toolbox for Realistic Dataset Generation for Testing Online and Offline 3D Bin Packing Algorithms
نویسندگان
چکیده
Packing products into a pallet or other medium is an unavoidable activity for producing companies. In many cases, packing based on operator experience and training using patterns that have worked before. Automated packing, the hand, requires systematic procedure devising solutions. scientific literature, this problem known as 3D bin (3DBP) authors proposed exact heuristic solutions variations of problem. There is, however, lack datasets can be used to test validate such Many available use randomly generated with extremely limited connection real practice. Furthermore, they contain reduced number product configurations ignore relates customers’ orders, which specific relative mixes products. This paper proposes software toolbox generating arbitrarily large 3DBPP industry data. The was developed in analysis dataset from food beverages sector, enabled creation several synthetic datasets. are publicly generate additional data testing validating 3DBP increasingly becoming dependent driven. ability good quality support development problems extreme importance. work step direction domain where open scarce.
منابع مشابه
Comparing online algorithms for bin packing problems
The relative worst-order ratio is a measure of the quality of online algorithms. In contrast to the competitive ratio, this measure compares two online algorithms directly instead of using an intermediate comparison with an optimal offline algorithm. In this paper, we apply the relative worst-order ratio to online algorithms for several common variants of the bin packing problem. We mainly cons...
متن کاملOnline algorithms with advice for bin packing and scheduling problems
We consider the setting of online computation with advice and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of 1 with only a constant number of bits of advice per request. For the bin packing problem, we give an online algorithm with advice that is (1 + ε)competitive and uses...
متن کاملOnline algorithms with advice for the dual bin packing problem
This paper studies the problem of maximizing the number of items packed into n bins, known as the dual bin packing problem, in the advice per request model. In general, no online algorithm has a constant competitive ratio for this problem. An online algorithm with 1 bit of advice per request is shown to be 3/2-competitive. Next, for 0 < ε < 1/2, an online algorithm with advice that is (1/(1− ε)...
متن کاملOnline algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional sp...
متن کاملOnline Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items) arrive one by one, each item must be packed into a square bin of unit size on its arrival without any information about future items. When packing items, 90◦-rotation is allowed. 1-space bounded means there is only one “active” bin. If the “active” bin cannot acco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Processes
سال: 2023
ISSN: ['2227-9717']
DOI: https://doi.org/10.3390/pr11071909